Graph theoretical ideas are highly utilized by computer science fieldsespecially data mining. In this field, a data structure can be designed in theform of tree. Covering is a widely used form of data representation in datamining and covering-based rough sets provide a systematic approach to this typeof representation. In this paper, we study the connectedness of graphs throughcovering-based rough sets and apply it to connected matroids. First, we presentan approach to inducing a covering by a graph, and then study the connectednessof the graph from the viewpoint of the covering approximation operators.Second, we construct a graph from a matroid, and find the matroid and the graphhave the same connectedness, which makes us to use covering-based rough sets tostudy connected matroids. In summary, this paper provides a new approach tostudying graph theory and matroid theory.
展开▼
